Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs

نویسندگان

  • Paolo Baldan
  • Nadia Busi
  • Andrea Corradini
  • G. Michele Pinna
چکیده

We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work of Winskel on safe nets, the truly concurrent semantics is given at a categorical level via a chain of functors leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. As an intermediate semantic model, we introduce inhibitor event structures, an extension of prime event structures able to faithfully capture the dependencies among events which arise in the presence of read and inhibitor arcs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain and event structure semantics for Petri nets with read and inhibitor arcs

We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work by Winskel on safe (ordinary) nets, the truly concurrent semantics is given at a categorical level via a chain of coreflections leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime alg...

متن کامل

Pre-nets, Read Arcs and Unfolding: A Functorial Presentation

Pre-nets have been recently proposed as a means of providing a functorial algebraic semantics to Petri nets (possibly with read arcs), overcoming some previously unsolved subtleties of the classical model. Here we develop a functorial semantics for pre-nets following a sibling classical approach based on an unfolding construction. Any pre-net is mapped to an acyclic branching net, representing ...

متن کامل

Event Structure Semantics for Dynamic Contextual Nets?

Petri nets and Graph Transformation Systems (GTSs) are two well-known models for concurrent systems. Petri nets, conceptually simpler, had became a reference model for experimenting with and developing new semantic approaches to concurrency, notably non-sequential processes, unfolding constructions, event structures and algebraic models. Graph Transformation Systems provide a more sophisticated...

متن کامل

Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars

Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed systems, which properly extends Petri nets. The idea is that the state of a distributed system can be naturally represented (at a suitable level of abstraction) as a graph and local state transform...

متن کامل

Two Algebraic Process Semantics for Contextual Nets

We show that the so-called ‘Petri nets are monoids’ approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering suitable nonfree monoids of places. The algebraic characterizations of net concurrent computations we provide cover both the collective and the individual token philosophy, uniformly along the two interpretat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000